Proper blocking sets in projective spaces

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blocking sets in finite projective spaces and coding theory

Preface The book in front of you represents my work as a PhD student. Using the word 'work' in this context is not really appropriate. During the past three years, I never had the feeling to 'work', but rather to play around with various structures, to have fun trying to prove theorems and to enjoy discovering just a tiny bit of the enormous mathematical world. This thesis is a structured way o...

متن کامل

Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes

In this article we shall prove that, for q = p prime and roughly 3 8 -th’s of the values of d < q k−1, there is no linear code meeting the Griesmer bound. This result uses Blokhuis’ theorem on the size of a t-fold blocking set in PG(2, p), p prime, which we generalise to higher dimensions. We also give more general lower bounds on the size of a t-fold blocking set in PG(δ, q), for arbitrary q a...

متن کامل

Some New Characterizations of Graph Colorability and of Blocking Sets of Projective Spaces

Let G = (V,E) be a graph and q be an odd prime power. We prove that G possess a proper vertex coloring with q colors if and only if there exists an odd vertex labeling x ∈ FV q of G. Here x is called odd if there is an odd number of partitions π = {V1, V2, . . . , Vt} of V whose blocks Vi are G-bipartite and x-balanced, i.e., such that G|Vi is connected and bipartite, and ∑ v∈Vi xv = 0. Other n...

متن کامل

On Discrete Borel Spaces and Projective Sets

Let J denote the unit interval, S—IXI the unit square; Cj and Cs the class of all subsets of I and 6, respectively. By Cj X Cj is meant the or-algebra on S generated by rectangles with sides in C/. The purpose of this note is to prove the following theorem (which settles a problem of S. M. Ulam) and observe some of its consequences. Without explicit mention, the axiom of choice has been assumed...

متن کامل

Blocking sets of Rédei type in projective Hjelmslev planes

The aim of this paper is to generalize the notion of a Rédei type blocking set to projective Hjelmslev planes. In what follows, we focus on Hjelmslev planes over chain rings of nilpotencey index 2, i.e. chain rings with rad R 6= (0) and (rad R)2 = (0). Thus we have always |R| = q2, where R/ rad R ∼= Fq. Chain rings with this property have been classified in [1, 6]. If q = pr there are exactly r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1997

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(96)00294-4